<TITLE>prob020: darts tournament</TITLE>
<HR><!------------------------------------------------------------------------>
<CENTER>
<H1>prob020: darts tournament</H1>

<TABLE>
<TR> <TD> proposed by
     <TD ALIGN=LEFT> <A HREF="http://www.cs.york.ac.uk/~tw">
          <B>Toby Walsh</B></A> 
          <ADDRESS><a href="mailto:tw@cs.york.ac.uk">
          tw@cs.york.ac.uk</a></ADDRESS>
</TABLE>
</CENTER>
<HR><!------------------------------------------------------------------------>
<H3> Results </H3>

To find just the best thrower, a ladder tournament is optimal.
However, as Lewis Carrol pointed out, a ladder may not find
the second best thrower (since they may be beaten by the best
thrower in an early match). I solicit solutions to the problem
of identifying the
<i>k</i> best throwers where <i>k</i> > 1 
(and especially for <i>k</i>=4 as this 
was the original question to comp.theory). 

<P>



<HR><!------------------------------------------------------------------------>

<UL>

 <A HREF="../../index.html"> Back</A> to CSPLib home page.


